Energy efficient joint data aggregation and link scheduling in solar sensor networks

Solar sensor nodes equipped with micro-solar subsystems [1] provide a novel approach to harvest ambient energy, which partially alleviated the energy-limitation in traditional wireless sensor networks. However, it also poses new challenges that the amounts of energy harvested by nodes are dynamic and unbalanced among them thus network life cannot be necessarily prolonged if no well-designed energy-scheduling is adopted. Herein, we present an algorithm to construct Energy-efficient Data Aggregation Tree (EDAT) based on a Maximum-Weighted Connected Dominating Set (MaCDS). The EDAT aims to prolong network life by minimizing differences in energy consumption among sensor nodes. Here we assume that the amount of harvested energy H randomly and uniformly distributes in the interval 1⁄2Hmin;Hmax , where Hmax and Hmin are respectively the maximum and the minimum of H. The total energy consumption difference of an EDAT is at most 5 eHjSj2 n 1 , where e H 1⁄4 j1⁄2Hmin;Hmax j, and S is the dominating set and n the total number of nodes. Furthermore, we designed a link-scheduling algorithm to minimize the number of time slots necessary for scheduling all links in the whole network based on EDAT. The number of time slots is bounded in the interval [4d 1,2lk.], where lk is determined by hops k;. 1⁄4 max D; Hmax Hmin j k n o , and d and D are respectively the minimal and maximal degree of the network. We found the most efficient work period is not determined by the node with the minimum harvested energy but by the one with the minimum d , where d is the node’s degree in the EDAT. We determine the necessary condition required for every node to have sufficient energy to support consecutive